Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
نویسنده
چکیده
TheMinkowski sum of two setsA,B ∈ IR, denotedA⊕B, is defined as {a+ b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in IR using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison to the widely-used methods for Minkowski-sum computation that decompose the input polygons into convex sub-polygons and compute the union of the pairwise sums of these convex sub-polygon. Our source code, as well as the data sets we used in our experiments, can be downloaded from: http://www.cs.tau.ac.il/∼wein/software/.
منابع مشابه
Polygonal Minkowski Sums via Convolution : Theory and Practice
This thesis studies theoretical and practical aspects of the computation of planar polygonal Minkowski sums via convolution methods. In particular we prove the “Convolution Theorem”, which is fundamental to convolution based methods, for the case of simple polygons. To the best of our knowledge this is the first complete proof for this case. Moreover, we describe a complete, exact and efficient...
متن کاملPolynomial/Rational Approximation of Minkowski Sum Boundary Curves
Given two planar curves, their convolution curve is defined as the set of all vector sums generated by all pairs of curve points which have the same curve normal direction. The Minkowski sum of two planar objects is closely related to the convolution curve of the two object boundary curves. That is, the convolution curve is a superset of the Minkowski sum boundary. By eliminating all redundant ...
متن کاملPolynomial/Rational Approximation of Minkowski Sum Boundary Curves 1
Given two planar curves, their convolution curve is defined as the set of all vector sums generated by all pairs of curve points which have the same curve normal direction. The Minkowski sum of two planar objects is closely related to the convolution curve of the two object boundary curves. That is, the convolution curve is a superset of the Minkowski sum boundary. By eliminating all redundant ...
متن کاملExact Minkowski Sums of Polygons With Holes
We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. Its efficiency stems in part from a property for Minkowski sums of polygons with holes, which in fact holds in any dimension: Given two polygons with holes, for each input polygon we can fill up the holes that are relatively small compa...
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کامل